Experimental realization of an entanglement access network and secure multi-party computation
نویسندگان
چکیده
To construct a quantum network with many end users, it is critical to have a cost-efficient way to distribute entanglement over different network ends. We demonstrate an entanglement access network, where the expensive resource, the entangled photon source at the telecom wavelength and the core communication channel, is shared by many end users. Using this cost-efficient entanglement access network, we report experimental demonstration of a secure multiparty computation protocol, the privacy-preserving secure sum problem, based on the network quantum cryptography.
منابع مشابه
Quantum Private Comparison: A Review
As an important branch of quantum secure multiparty computation, quantum private comparison (QPC) has attracted more and more attention recently. In this paper, according to the quantum implementation mecha‐ nism that these protocols used, we divide these protocols into three categories: The quantum cryptography QPC, the superdense coding QPC, and the entanglement swapping QPC. And then, a more...
متن کاملHow to Use Bitcoin to Design Fair Protocols
We study a model of fairness in secure computation in which an adversarial party that aborts on receiving output is forced to pay a mutually predefined monetary penalty. We then show how the Bitcoin network can be used to achieve the above notion of fairness in the two-party as well as the multiparty setting (with a dishonest majority). In particular, we propose new ideal functionalities and pr...
متن کاملAmortized Sublinear Secure Multi Party Computation
We study the problem of secure two-party and multi-party computation in a setting where some of the participating parties hold very large inputs. Such settings increasingly appear when participants wish to securely query a database server, a typical situation in cloud related applications. Classic results in secure computation require work that grows linearly with the size of the input, while i...
متن کاملQuantum And Relativistic Protocols For Secure Multi-Party Computation
Secure multi-party computation is a task whereby mistrustful parties attempt to compute some joint function of their private data in such a way as to reveal as little as possible about it. It encompasses many cryptographic primitives, including coin tossing and oblivious transfer. Ideally, one would like to generate either a protocol or a no-go theorem for any such task. Very few computations o...
متن کاملQuorum-Based Secure Multi-party Computation
This paper describes efficient protocols for multi-party computations that are information-theoretically secure against passive attacks. The results presented here apply to access structures based on quorum systems, which are collections of sets enjoying a naturallymotivated self-intersection property. Quorum-based access structures include threshold systems but are far richer and more general,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 6 شماره
صفحات -
تاریخ انتشار 2016